Convergence of simple random walks on random discrete trees to Brownian motion on the continuum random tree
نویسندگان
چکیده
منابع مشابه
Random Walks and Brownian Motion
In today’s lecture we present the Brownian motion (BM). We start with an intuitive discussion, describing the BM as a limit of SRW. We present some of the BM properties and try to explain why we can expect these properties from a limit of SRW. We then give a formal definition for BM and prove such a process exists (Wiener 1923). Before the proof we give some important facts about the normal dis...
متن کاملRandom Walks and Brownian Motion
Tags for today's lecture: Donsker's invariance priciple, Stochastic integration, Itô's formula In this lecture we show an application of Donsker's invariance principle and then proceed to the construction of Itô's stochastic integral. We recall the definitions and give a simple example of an application of the invariance principle. Consider a random walk S n = Σ n i=1 x i with E(x) = 0, E(x 2) ...
متن کاملConvergence of random walks to Brownian motion in phylogenetic tree-space
The set of all phylogenetic trees for a fixed set of species forms a geodesic metric space known as Billera-Holmes-Vogtmann tree-space. In order to analyse samples of phylogenetic trees it is desirable to construct parametric distributions on this space, but this task is very challenging. One way to construct such distributions is to consider particles undergoing Brownian motion in tree-space f...
متن کاملRandom walks on complex trees.
We study the properties of random walks on complex trees. We observe that the absence of loops is reflected in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present a considerable slowing down in the tree case. Second, the mean first passage time (MFPT) display...
متن کاملRandom Walks on Rooted Trees
For arbitrary positive integers h and m, we consider the family of all rooted trees of height h having exactly m vertices at distance h from the root. We refer to such trees as (h,m)-trees. For a tree T from this family, we consider a simple random walk on T which starts at the root and terminates when it visits one of the m vertices at distance h from the root. Consider the problem of finding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2008
ISSN: 0246-0203
DOI: 10.1214/07-aihp153